Multi‐stage adjustable robust optimization for process scheduling under uncertainty
نویسندگان
چکیده
منابع مشابه
Adjustable Robust Multistage Optimization
Format (5.1.1) covers all uncertain optimization problems considered so far; moreover, in these latter problems the objective f and the right hand side F of the constraints always were bi-affine in x, ζ, (that is, affine in x when ζ is fixed, and affine in ζ, x being fixed), and K was a “simple” convex cone (a direct product of nonnegative rays/Lorentz cones/Semidefinite cones, depending on whe...
متن کاملA Data-Driven Multistage Adaptive Robust Optimization Framework for Planning and Scheduling under Uncertainty
A novel data-driven approach for optimization under uncertainty based on multistage adaptive robust optimization (ARO) and nonparametric kernel density M-estimation is proposed. Different from conventional robust optimization methods, the proposed framework incorporates distributional information to avoid over-conservatism. Robust kernel density estimation with Hampel loss function is employed ...
متن کاملOn the approximability of adjustable robust convex optimization under uncertainty
In this paper, we consider adjustable robust versions of convex optimization problems with uncertain constraints and objectives and show that under fairly general assumptions, a static robust solution provides a good approximation for these adjustable robust problems. An adjustable robust optimization problem is usually intractable since it requires to compute a solution for all possible realiz...
متن کاملRobust Optimization for Scheduling under Bounded Uncertainty in Processing Times
A novel robust optimization methodology is proposed for scheduling under bounded uncertainty in processing times. This approach generates “robust” solutions which are in a sense immune against uncertainty when it is applied to Mixed-Integer Linear Programming (MILP) problems with uncertain coefficients and right-hand-side parameters of the inequality constraints. By introducing a small number o...
متن کاملAdvances in Robust Optimization Approaches for Scheduling under Uncertainty
The problem of scheduling under uncertainty is addressed. We propose a novel robust optimization methodology, which when applied to Mixed-Integer Linear Programming (MILP) problems produces “robust” solutions that are, in a sense, immune against uncertainty. The robust optimization approach is applied to the scheduling under uncertainty problem. Based on a novel and effective continuous-time sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIChE Journal
سال: 2016
ISSN: 0001-1541,1547-5905
DOI: 10.1002/aic.15183